Simplicial complex

Results: 124



#Item
21d-collapsibility is NP-complete for d ≥ 4 Martin Tancer∗ November 28, 2009 Abstract A simplicial complex is d-collapsible if it can be reduced to an

d-collapsibility is NP-complete for d ≥ 4 Martin Tancer∗ November 28, 2009 Abstract A simplicial complex is d-collapsible if it can be reduced to an

Add to Reading List

Source URL: iti.mff.cuni.cz

Language: English - Date: 2016-02-04 05:53:37
    22How Complex are Real Algebraic Objects? Michael Kerber Michael Sagraloff  Max-Planck-Institut f¨ur Informatik

    How Complex are Real Algebraic Objects? Michael Kerber Michael Sagraloff Max-Planck-Institut f¨ur Informatik

    Add to Reading List

    Source URL: people.mpi-inf.mpg.de

    Language: English - Date: 2010-01-21 09:20:44
    231  A Note on the Complexity of Real Algebraic Hypersurfaces Michael Kerber

    1 A Note on the Complexity of Real Algebraic Hypersurfaces Michael Kerber

    Add to Reading List

    Source URL: people.mpi-inf.mpg.de

    Language: English - Date: 2010-02-19 15:29:59
    24Linear-Size Approximations to the Vietoris–Rips Filtration Donald R. Sheehy March 8, 2013  Abstract

    Linear-Size Approximations to the Vietoris–Rips Filtration Donald R. Sheehy March 8, 2013 Abstract

    Add to Reading List

    Source URL: donsheehy.net

    Language: English - Date: 2015-01-15 16:06:03
    254. Chains and Contractions: the Proof of Proposition 10.  To prove Proposition 10 we need some facts about particular chains under contractions. Suppose X is an abstract simplicial complex, {u,w} = 77 G S (X), and q is t

    4. Chains and Contractions: the Proof of Proposition 10. To prove Proposition 10 we need some facts about particular chains under contractions. Suppose X is an abstract simplicial complex, {u,w} = 77 G S (X), and q is t

    Add to Reading List

    Source URL: www.armadillodanceproject.com

    Language: English - Date: 2010-10-22 11:09:45
      262. Basic Definitions.  We consider a set to be a collection of distinct objects. We denote the order of a set S by |S|. 0 denotes the empty set. An abstract simplicial complex is a nonempty finite set X of nonempty finit

      2. Basic Definitions. We consider a set to be a collection of distinct objects. We denote the order of a set S by |S|. 0 denotes the empty set. An abstract simplicial complex is a nonempty finite set X of nonempty finit

      Add to Reading List

      Source URL: www.armadillodanceproject.com

      Language: English - Date: 2010-10-22 11:08:40
        27d-representability of simplicial complexes of fixed dimension ∗ Martin Tancer† Abstract Let K be a simplicial complex with vertex set V = {v1 , . . . , vn }. The

        d-representability of simplicial complexes of fixed dimension ∗ Martin Tancer† Abstract Let K be a simplicial complex with vertex set V = {v1 , . . . , vn }. The

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:38
          28On Regular Vertices of the Union of Planar Convex Objects∗ Esther Ezra† J´anos Pach‡  Micha Sharir§

          On Regular Vertices of the Union of Planar Convex Objects∗ Esther Ezra† J´anos Pach‡ Micha Sharir§

          Add to Reading List

          Source URL: www.cims.nyu.edu

          Language: English - Date: 2009-09-24 16:00:36
          29Homotopy theory of moment-angle complexes based on joint work with Jelena Grbic, Stephen Theriault and Jie Wu Taras Panov Lomonosov Moscow State University  Torus Actions: Topology, Geometry and Number Theory

          Homotopy theory of moment-angle complexes based on joint work with Jelena Grbic, Stephen Theriault and Jie Wu Taras Panov Lomonosov Moscow State University Torus Actions: Topology, Geometry and Number Theory

          Add to Reading List

          Source URL: higeom.math.msu.su

          Language: English - Date: 2013-09-05 01:07:42
          30Shallow Packings in Geometry ∗ Esther Ezra † December 16, 2014 Abstract We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set

          Shallow Packings in Geometry ∗ Esther Ezra † December 16, 2014 Abstract We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set

          Add to Reading List

          Source URL: www.cims.nyu.edu

          Language: English - Date: 2014-12-19 01:11:03